Termination w.r.t. Q proof of TRS/D3328.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

if(if(x, y, z), u, v) → if(x, if(y, u, v), if(z, u, v))

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

if(if(x, y, z), u, v) → if(x, if(y, u, v), if(z, u, v))

Q is empty.

We use [23] with the following order to prove termination.

Lexicographic path order with status [19].
Quasi-Precedence:

trivial

Status:

if₃: [1,2,3]